Termination w.r.t. Q proof of /tmp/tmpMLFbq9/Ex6_GM04

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

c → f
f → g

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

c → f
f → g

Q is empty.

We use [27] with the following order to prove termination.

Knuth-Bendix order [24] with precedence:

c > f > g

and weight map:

c=1
g=1
f=1